on the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues

On the distance from a matrix polynomial to matrix polynomials with two prescribed eigenvalues

Consider an n × <span style="fon...

The distance from a matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue

For a matrix polynomial P (λ) and a given complex number μ, we introduce a (spectral norm) distance from P (λ) to the matrix polynomials that have μ as an eigenvalue of geometric multiplicity at least κ, and a distance from P (λ) to the matrix polynomials that have μ as a multiple eigenvalue. Then we compute the first distance and obtain bounds for the second one, constructing associated pertur...

On the distance from a weakly normal matrix polynomial to matrix polynomials with a prescribed multiple eigenvalue

On robust matrix completion with prescribed eigenvalues

Matrix completion with prescribed eigenvalues is a special kind of inverse eigenvalue problems. Thus far, only a handful of specific cases concerning its existence and construction have been studied in the literature. The general problem where the prescribed entries are at arbitrary locations with arbitrary cardinalities proves to be challenging both theoretically and computationally. This pape...

Algebraic adjoint of the polynomials-polynomial matrix multiplication

This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field

Matrix polynomials with specified eigenvalues

Article history: Received 25 January 2014 Accepted 9 October 2014 Available online 5 November 2014 Submitted by F. Dopico MSC: 65F15 65F18 47A56